Investigating the Effect of Uniform Random Distribution of Nodes in Wireless Sensor Networks Using an Epidemic Worm Model
نویسندگان
چکیده
The emergence of malicious codes that attack Wireless Sensor Networks (WSN) made it necessary to direct research attention to security. These attacks arising from worms pose devastating threats to networks which can lead to substantial losses or damages. However, recent models developed for the purpose of understanding worm transmission patterns and ensuring its containment did not account for the effect of uniform random deployment of sensor nodes on the Exposed and the Vaccinated compartments. Therefore, in this paper we present a modified Susceptible–Exposed–Infectious–Recovered–Susceptible with Vaccination (SEIRS-V) model for worm propagation dynamics in sensor networks. Our model applies the expression for uniform distribution deployment of sensor nodes so as to study the effect of distribution density and transmission range on the characterized compartments. Furthermore, we presented solutions for the equilibrium points, the reproduction number and proof of stability. Finally, we employed numerical methods to solve and simulate with real values the developed system of differential equations. CCS Concepts Computer systems organizations Embedded and cyberphysical systems Sensor networks. • Security and privacy Intrusion/anomaly detection and malware mitigation Malware and its mitigation. • Mathematics of computing Mathematical analysis Differential equations Ordinary differential equations. • Computing Methodologies modeling and simulation Model development and analysis, Simulation support systems.
منابع مشابه
LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملAn efficient solution for management of pre-distribution in wireless sensor networks
A sensor node is composed of different parts including processing units, sensor, transmitter, receiver, and security unit. There are many nodes in a sensor unit. These networks can be used for military, industrial, medicine, environmental, house, and many other applications. These nodes may be established in the lands of enemies to monitor the relations. Hence, it is important to consider conse...
متن کاملMitigating Node Capture Attack in Random Key Distribution Schemes through Key Deletion
Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...
متن کاملHybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016